Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm
نویسنده
چکیده
In this naper we describe the ?roqerties of the line graoh of r-acyclic hynergraphs. Based on the orooerties, an efficient algorj. thm is civen for determining whether a hypergraph is facyclic. The algorithm runs in O(n(n+e)) time for a hypersranh with its line granh havin? n vFrtices and e edyes.
منابع مشابه
Line graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملSkeletonization and classification by Bayesian classifier algorithm for object recognition
This paper describes and demonstrates a graphical method of Skeletal Shock Graph, which is based on the shape or geometry of the object. Shock Graph is an abstraction of the skeleton of a shape onto a Directed Acyclic Graph (DAG) in which the skeleton points are labeled according to the local variation of the radius function at each point. A large image data base is created by using suitable im...
متن کاملPerformance Evaluation of Object Recognition Using Skeletal Shock Graph: Challenges and Future Prospects
This paper describes a graphical method of Skeletal Shock Graph, which is based on the shape or geometry of the object. Shock Graph is an abstraction of the skeleton of a shape onto a Directed Acyclic Graph (DAG) in which the skeleton points are labeled according to the local variation of the radius function at each point. A large image data base is created by using suitable image acquisition t...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملRecognition of the group $G_2(5)$ by the prime graph
Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984